Delay Evaluation of OpenFlow Network Based on Queueing Model
نویسندگان
چکیده
As one of the most popular south-bound protocol of software-defined networking(SDN), OpenFlow decouples the network control from forwarding devices. It offers flexible and scalable functionality for networks. These advantages may cause performance issues since there are performance penalties in terms of packet processing speed. It is important to understand the performance of OpenFlow switches and controllers for its deployments. In this paper we model the packet processing time of OpenFlow switches and controllers. We mainly analyze how the probability of packet-in messages impacts the performance of switches and controllers. Our results show that there is a performance penalty in OpenFlow networks. However, the penalty is not much when probability of packet-in messages is low. This model can be used for a network designer to approximate the performance of her deployments.
منابع مشابه
Challenges and solution for measuring available bandwidth in software defined networks
Software Defined Networking (SDN) is an emerging paradigm that is expected to revolutionize computer networks. Methods for measuring Quality of Service (QoS) parameters such as bandwidth utilization, packet loss, and delay have been recently introduced in literature for SDN-based scenarios, but they required almost invariably a completely different approach with respect to traditional network e...
متن کاملHyperFlow: A Distributed Control Plane for OpenFlow
OpenFlow assumes a logically centralized controller, which ideally can be physically distributed. However, current deployments rely on a single controller which has major drawbacks including lack of scalability. We present HyperFlow, a distributed event-based control plane for OpenFlow. HyperFlow is logically centralized but physically distributed: it provides scalability while keeping the bene...
متن کاملPerformance evaluation for DRED discrete-time queueing network analytical model
Due to the rapid development in computer networks, congestion becomes a critical issue. Congestion usually occurs when the connection demands on network resources, i.e. buffer spaces, exceed the available ones. We propose in this paper a new discrete-time queueing network analytical model based on dynamic random early drop (DRED) algorithm to control the congestion in early stages. We apply our...
متن کاملCapacity planning in the hospital queueing network with blocking: simulation-based optimization approach
Introduction: Hospital administrators have always faced the challenge of providing the best possible health services in a resource-limited environment. The patient flow throughout the hospital is affected by lack of the capacities that can lead to bed-blocking among the hospital units. In this research, the patient flow in the hospital is modeled as an open queueing network with blocking. Then,...
متن کاملModelling and Compensation of uncertain time-delays in networked control systems with plant uncertainty using an Improved RMPC Method
Control systems with digital communication between sensors, controllers and actuators are called as Networked Control Systems (NCSs). In general, NCSs encounter with some problems such as packet dropouts and network induced delays. When plant uncertainty is added to the aforementioned problems, the design of the robust controller that is able to guarantee the stability, becomes more complex. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1608.06491 شماره
صفحات -
تاریخ انتشار 2016